Approximate MDS Property of Linear Codes
نویسندگان
چکیده
In this paper, we study the weight spectrum of linear codes with super-linear field size and use probabilistic method to show that for nearly all such codes, corresponding is very close a maximum distance separable (MDS) code.
منابع مشابه
MDS Codes with Progressive Engagement Property for Cloud Storage Systems
Fast and efficient failure recovery is a new challenge for cloud storage systems with a large number of storage nodes. A pivotal recovery metric upon the failure of a storage node is repair bandwidth cost which refers to the amount of data that must be downloaded for regenerating the lost data. Since all the surviving nodes are not always accessible, we intend to introduce a class of maximum di...
متن کاملLinear codes on posets with extension property
We investigate linear and additive codes in partially ordered Hamming-like spaces that satisfy the extension property, meaning that automorphisms of ideals extend to automorphisms of the poset. The codes are naturally described in terms of translation association schemes that originate from the groups of linear isometries of the space. We address questions of duality and invariants of codes, es...
متن کاملExtending MDS Codes
A q-ary (n,k)-MDS code, linear or not, satisfies n≤ q+ k−1. A code meeting this bound is said to have maximum length. Using purely combinatorial methods we show that an MDS code with n = q + k− 2 can be uniquely extended to a full length code if and only if q is even. This result is best possible in the sense that there is, for example, a non-extendable 4-ary (5,4)-MDS code. It may be that the ...
متن کاملAlmost MDS Codes
MDS codes are codes meeting the Singleton bound. Both for theory and practice, these codes are very important and have been studied extensively. Codes near this bound, but not attaining it, have had far less attention. In this paper we study codes that almost reach the Singleton bound.
متن کاملOn MDS elliptic codes
Munuera, C., On MDS elliptic codes, Discrete Mathematics 117 (1993) 2799286. In this paper we give a bound for MDS (maximum distance separable) algebraic-geometric codes arising from elliptic curves. Several consequences are presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Trends in mathematics
سال: 2021
ISSN: ['2297-024X', '2297-0215']
DOI: https://doi.org/10.1007/978-3-030-83823-2_16